Efficient Link Scheduling Based on Estimated Number of Packets in Queue on Industrial Wireless Sensor Networks

The links of low power wireless sensor networks are error prone and the transmission on a link is determined probabilistically by packet reception rate (PRR) link. On other hand, there very strict requirement in end-to-end reliability delay data industrial (IWSNs). existing approaches to provide IWSNs retransmitting when failure occurs. These transmit multiple times successive time slots required reliability. approaches, however, can increase average packets number buffered queue. This paper proposes new scheme estimate probabilistic amount packets, called queue level (QL), buffer each node based PRRs links. also QL-based centralized scheduling algorithm assign efficiently TDMA-based IWSNs. proposed gives higher priority nodes with QL. By assigning first highest QL, we reduce while satisfying performance have been evaluated through simulation using Cooja simulator compared approach. In an sample network target 99%, all flows were shown guarantee both algorithms: average, 99.76% 99.85% showed much better than approach terms (about 47% less) maximally (maximally, more 90% less).